Detection of Recurrences in Sequential Programs with Loops
نویسندگان
چکیده
To improve the performances of parallelizing compilers, one must detect recurrences in scientiic programs and subject them to special parallelization methods. We present a method for detecting recurrences which is based on the analysis of Systems of Recurrence Equations. This method identiies recurrences on arrays, recurrences of arbitrary order and multi-equations recurrences. We explain how to associate a SRE to a restricted class of imperative programs. We present a normalization of such SRE that allows the detection of recurrences by simple inspection of equations. When detected, a recurrence may be replaced by a symbolic expression of its solution. To iterate the process can lead to the identiication of multi-dimensional recurrences.
منابع مشابه
On Automatic Loop Data-Mapping for Distributed-Memory Multiprocessors
In this paper we present a unified approach for compiling programs for Distributed-Memory Multiprocessors (DMM). Parallelization of sequential programs for DMM is much more difficult to achieve than for shared memory systems due to the exclusive local memory of each Virtual Processor (VP). The approach presented distributes computations among VPs of the system and maps data onto their private m...
متن کاملAutomatic Parallelization of " Inherently " Sequential Nested Loop Programs
AUTOMATIC PARALLELIZATION OF "INHERENTLY" SEQUENTIAL NESTED LOOP PROGRAMS Most automatic parallelizers are based on detection of independent operations, and most of them cannot do anything if there is a true dependence between operations. However, there exists a class of programs for which this can be surmounted based on the nature of the operations. The standard and obvious cases are reduction...
متن کاملPractical Experiments with Symbolic Loop Bound Computation for WCET Analysis1
We present an automatic method for computing tight upper bounds on the iteration number of special classes of program loops. These upper bounds are further used in the WCET analysis of programs. Program flow is refined using SMT reasoning, rewriting multi-path loops into single-path ones. Single-path loops are further translated into a set of recurrence relations over program variables. To solv...
متن کاملParallel Solutions of Simple Index Recurrence Equations
We deene a new type of recurrence equation called \Simple Indexed Recurrences" (SIR). In this type of equation, ordinary recurrences of the form Xi] = opi(Xi ? 1]; Xi]) i = 1 : : : n are generalized to Xg(i)] = opi(Xf(i)];Xg(i)]), where f; g : f1 : : : ng 7 ! f1 : : : mg and g is distinct. This enables us to model sequential loops of the form for i = 1 to n Xg(i)] = opi(Xf(i)];Xg(i)]); as a seq...
متن کاملTransformation of Sequential Programs into Parallel Forms
One of the main tasks of a programmer when writing parallel programs is to identify the parts that are to be executed in parallel. This process is very timeconsuming and error prone. As an alternative, one can write its sequential version and then transform it into the parallel form by a parallelizing compiler. The loops in the sequential programs offer the best opportunities for parallelism. T...
متن کامل